The Shrinking Property for NP and coNP

نویسندگان

  • Christian Glaßer
  • Christian Reitwießner
  • Victor L. Selivanov
چکیده

We study the shrinking and separation properties (two notions well-known in descriptive set theory) for NP and coNP and show that under reasonable complexity-theoretic assumptions, both properties do not hold for NP and the shrinking property does not hold for coNP. In particular we obtain the following results. 1. NP and coNP do not have the shrinking property, unless PH is finite. In general, Σn and Πn do not have the shrinking property, unless PH is finite. This solves an open question from [Sel94a]. 2. The separation property does not hold for NP, unless UP ⊆ coNP. 3. The shrinking property does not hold for NP, unless there exist NP-hard disjoint NPpairs (existence of such pairs would contradict a conjecture by Even, Selman, and Yacobi [ESY84]). 4. The shrinking property does not hold for NP, unless there exist complete disjoint NP-pairs. Moreover, we prove that the assumption NP 6= coNP is too weak to refute the shrinking property for NP in a relativizable way. For this we construct an oracle relative to which P = NP ∩ coNP, NP 6= coNP, and NP has the shrinking property. This solves an open question by Blass and Gurevich [BG84] who explicitly ask for such an oracle.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Two Bicliques Problem is in NP intersection coNP

We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NP∩coNP. We thus almost determine the computational complexity of a problem whose status has remained open for quite some time. Our result implies that a polynomial time algorithm for the problem is more likely than it being NP-complete unless P = NP. keywords: Bicliques, Polyn...

متن کامل

Contracting Few Edges to Remove Forbidden Induced Subgraphs

For a given graph property Π (i.e., a collection Π of graphs), the Π-Contraction problem is to determine whether the input graph G can be transformed into a graph satisfying property Π by contracting at most k edges, where k is a parameter. In this paper, we mainly focus on the parameterized complexity of Π-Contraction problems for Π being H-free (i.e., containing no induced subgraph isomorphic...

متن کامل

Universal First-Order Logic is Superfluous for NL, P, NP and coNP

In this work we continue the syntactic study of completeness that began with the works of Immerman and Medina. In particular, we take a conjecture raised by Medina in his dissertation that says if a conjunction of a second-order and a first-order sentences defines an NP-complete problems via fops, then it must be the case that the secondorder conjoint alone also defines a NP-complete problem. A...

متن کامل

Complicated Complementations

Kolmogorov complexity has proven to be a very useful tool in simplifying and improving proofs that use complicated combinatorial arguments. In this paper we use Kolmogorov complexity for oracle construction. We obtain separation results that are much stronger than separations obtained previously even with the use of very complicated combinatorial arguments. Moreover the use of Kolmogorov argume...

متن کامل

Recognizing Pseudo-intents is coNP-complete

The problem of recognizing whether a subset of attributes is a pseudo-intent is shown to be coNP-hard, which together with the previous results means that this problem is coNP-complete. Recognizing an essential intent is shown to be NP-complete and recognizing the lectically largest pseudo-intent is shown to be coNP-hard.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008